An Algorithm for Solving S-Games and Differential S-Games
نویسندگان
چکیده
منابع مشابه
An Introduction to Conway ’ S Games
Combinatorial Game Theory is a fascinating and rich theory, based on a simple and intuitive recursive definition of games, which yields a very rich algebraic structure: games can be added and subtracted in a very natural way, forming an abelian GROUP (§ 2). There is a distinguished subGROUP of games called numbers which can also be multiplied and which form a FIELD (§ 3): this field contains bo...
متن کاملPolynomial time algorithm for solving cyclic games
The problem of finding the value and optimal strategies of players in cyclic games is studied. A polynomial time algorithm for solving cyclic games is proposed.
متن کاملPlaying games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adversary chooses its own strategy. We consider Bayesian Stackelberg games, in which the leader is uncertain about the types of adversary it may face. Such games are important in security domains, where, for example, a se...
متن کاملS(i{e Experimental Games
This is a working paper. It may be expanded, modified, or withdrawn at any time. The views, conclusions, and recommendations expressed herein do not necessarily reflect the official views or policies of the United States Air Force.
متن کاملAn Efficient, Exact Algorithm for Solving Tree-Structured Graphical Games
We describe a new algorithm for computing a Nash equilibrium in graphical games, a compact representation for multi-agent systems that we introduced in previous work. The algorithm is the first to compute equilibria both efficiently and exactly for a non-trivial class of graphical games.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Control and Optimization
سال: 1982
ISSN: 0363-0129,1095-7138
DOI: 10.1137/0320055